Orthogonal Cauchy-like matrices
نویسندگان
چکیده
Abstract Cauchy-like matrices arise often as building blocks in decomposition formulas and fast algorithms for various displacement-structured matrices. A complete characterization orthogonal is given here. In particular, we show that correspond to eigenvector of certain symmetric related the solution secular equations. Moreover, construction rational functions with variable poles.
منابع مشابه
Fast QR factorization of Cauchy-like matrices
n this paper we present two fast numerical methods for computing the QR factorization of a Cauchy-like matrix C with data points lying on the real axis or on the unit circle in the complex plane. It is shown that the rows of the Q-factor of C give the eigenvectors of a rank structured matrix partially determined by some prescribed spectral data. This property establishes a basic connection betw...
متن کاملStable Pivoting for the Fast Factorization of Cauchy-Like Matrices
Recent work by Sweet and Brent on the fast factorization of Cauchy-like matrices through a fast version of Gaussian elimination with partial pivoting has uncovered a potential stability problem which is not present in ordinary Gaussian elimination: excessive growth in the generators used to represent the matrix and its Schur complements can lead to large errors. A natural way to x this problem ...
متن کاملOn Hankel-like matrices generated by orthogonal polynomials
A class of matrices is studied that could be considered as Hankel matrices with respect to a system of orthogonal polynomials. It is shown that they have similar properties like classical Hankel matrices. Main attention is paid to the construction of fast and superfast algorithms. The main tool is the fact that these matrices are matrix representation of multiplication operators.
متن کاملDisentangling orthogonal matrices.
Motivated by a certain molecular reconstruction methodology in cryo-electron microscopy, we consider the problem of solving a linear system with two unknown orthogonal matrices, which is a generalization of the well-known orthogonal Procrustes problem. We propose an algorithm based on a semi-definite programming (SDP) relaxation, and give a theoretical guarantee for its performance. Both theore...
متن کاملDisentangling Two Orthogonal Matrices
Motivated by a certain molecular reconstruction methodology in cryo-electron microscopy, we consider the problem of solving a linear system with two unknown orthogonal matrices, which is a generalization of the well-known orthogonal Procrustes problem. We propose an algorithm based on a semi-definite programming (SDP) relaxation, and give a theoretical guarantee for its performance. Both theore...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2022
ISSN: ['1017-1398', '1572-9265']
DOI: https://doi.org/10.1007/s11075-022-01391-y